On prime-valent symmetric graphs of square-free order
نویسندگان
چکیده
منابع مشابه
Cubic symmetric graphs of order a small number times a prime or a prime square
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular elementary abelian coverings of the complete bipartite graph K3,3 and the s-regular cyclic or elementary abelian coverings of the complete graph K4 for each s 1 are classified when the fibrepreserving automorphism groups act arc-transitively. A new infinite family of cubic 1-regu...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کامل5-valent Symmetric Graphs of Order at Most 100
1 "UI,J;:"~.VU.jJ of the automorphism group is said to be symmetric on r, a,U.llo,vuuv vertices of f; f is said (that is those groups act are vertex transitive and hence are The motivation for this paper came from Lorimer [1] about determining all minimal trivalent of order at most 120. Similar work for 5-valent the order of a cornpl.ete list of most 100. In stabilizer has upper bound that is 4...
متن کاملOn Edge-Transitive Graphs of Square-Free Order
We study the class of edge-transitive graphs of square-free order and valency at most k. It is shown that, except for a few special families of graphs, only finitely many members in this class are basic (namely, not a normal multicover of another member). Using this result, we determine the automorphism groups of locally primitive arc-transitive graphs with square-free order.
متن کاملSymmetric graphs of order 4p of valency prime
A graph is symmetric or arc-transitive if its automorphism group acts transitively on vertices, edges and arcs. Let p, q be odd primes with p, q ≥ 5 and X a q-valent symmetric graph of order 4p. In this paper, we proved that X K4p with 4p-1=q, X K2p,2p-2pK2 with 2p-1=q, the quotient graph of X is isomorphic to Kp,p and p=q, or K2p and 2p-1=q.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2017
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1161.3b9